Bisimulation in Inquisitive Modal Logic
نویسندگان
چکیده
Inquisitive modal logic, INQML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, INQML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate the natural notion of bisimulation equivalence in the setting of INQML. We compare the expressiveness of INQML and first-order logic, and characterise inquisitivemodal logic as the bisimulation invariant fragments of first-order logic over various classes of two-sorted relational structures. These results crucially require non-classical methods in studying bisimulations and first-order expressiveness over non-elementary classes.
منابع مشابه
Inquisitive bisimulation
Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in th...
متن کاملPropositional inquisitive logic: a survey
This paper provides a concise survey of a body of recent work on propositional inquisitive logic. We review the conceptual foundations of inquisitive semantics, introduce the propositional system, discuss its relations with classical, intuitionistic, and dependence logic, and describe an important feature of inquisitive proofs.
متن کاملBisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...
متن کاملA Characterisation of Open Bisimulation using an Intuitionistic Modal Logic
Open bisimulation is the greatest bisimulation congruence for the π-calculus. In open bisimulation, free names in processes are treated as variables that may be instantiated; in contrast to late bisimulation where free names are constants. An established modal logic due to Milner, Parrow, and Walker characterises late bisimulation, that is, two processes satisfy the same set of formulae if and ...
متن کاملForschungsberichte Des Fachbereichs Informatik Modal Characterization of Weak Bisimulation for Higher{order Processes Modal Characterization of Weak Bisimulation for Higher{order Processes
Context bisimulation 13, 1] has become an important notion of behavioral equivalence for higher{order processes. Weak forms of context bisimulation are particularly interesting, because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second{order processes. We show how the logic permits com...
متن کامل